Heap-Filter Merge Join: A new algorithm for joining medium-size relations

Heap-Filter Merge Join: A New Algorithm For Joining Medium-Size Inputs

Hash-based Symmetric Data Structure and Join Algorithm for OLAP Applications

Star schema is often used in dimensional approaches applied to OLAP applications. The fact table in the star schema typically contains a huge amount of data. When some of the dimension tables are also very large, it may take too much time and storage to join the fact table with these dimension tables. The performance of join algorithm becomes critical under such a condition. The uent join is a ...

To appear in SIGMOD 1996 1 Partition Based Spatial – Merge Join

This paper describes PBSM (Partition Based Spatial–Merge), a new algorithm for performing spatial join operation. This algorithm is especially effective when neither of the inputs to the join have an index on the joining attribute. Such a situation could arise if both inputs to the join are intermediate results in a complex query, or in a parallel environment where the inputs must be dynamicall...

An Evaluation of Non-Equijoin Algorithms

A non-equijoin of relations R and S is a band join if the join predicate requires values in the join attribute of R to fall within a speci ed band about the values in the join attribute of S. We propose a new algorithm, termed a partitioned band join, for evaluating band joins. We present a comparison between the partitioned band join algorithm and the classical sort-merge join algorithm (optim...

Composition of Database Relations

The “standard” method of implementing composition is to perform join and projection as one combined operation and then to remove the duplicates from the result of this operation as a separate step. When a hash-based or sort-merge algorithm is used for the join operation and the size of the result is large, duplicates cannot be eliminated at the same time the join is being performed. In this pap...